Matrices with the Edmonds - Johnson property
نویسندگان
چکیده
A matrix A = (a~j) has the Edmonds--Johnson property if, for each choice of integral vectors dl, d,., b~, b~, the convex hull of the integral solutions of dt~-x~-d2, bt~-Ax~-b.~ is obtained by adding the inequalities cx~_[~], where c is an integral vector and cx~_J holds for each solution of da~_x~_d2, b~_Ax~_b.. We characterize the Edmonds--Johnson property for integral matrices A which satisfy S la~j[-~2 for each (row index) i. A corollary is that if G is an undirected 1 graph which does not contain any hom~omorph of / (4 in which all triangles of/(4 have become odd circuits, then G is t-perfect. This extends results of Boulala, Fonlupt, Sbihi and Uhry.
منابع مشابه
On matrices with the Edmonds-Johnson property arising from bidirected graphs
In this paper we study totally half-modular matrices obtained from {0,±1}-matrices with at most two nonzero entries per column by multiplying by 2 some of the columns. We give an excluded-minor characterization of the matrices in this class having strong Chvàtal rank 1. Our result is a special case of a conjecture by Gerards and Schrijver [6]. It also extends a well known theorem of Edmonds and...
متن کاملPath Partitions, Cycle Covers and Integer Decomposition
A polyhedron P has the integer decomposition property, if every integer vector in kP is the sum of k integer vectors in P . We explain that the projections of polyhedra defined by totally unimodular constraint matrices have the integer decomposition property, in order to deduce the same property for coflow polyhedra defined by Cameron and Edmonds. We then apply this result to the convex hull of...
متن کاملRobustness Properties of Dimensionality Reduction with Gaussian Random Matrices
In this paper we study the robustness properties of dimensionality reduction with Gaussian random matrices having arbitrarily erased rows. We first study the robustness property against erasure for the almost norm preservation property of Gaussian random matrices by obtaining the optimal estimate of the erasure ratio for a small given norm distortion rate. As a consequence, we establish the rob...
متن کاملClassical complexity and quantum entanglement
Generalizing a decision problem for bipartite perfect matching, Edmonds (J. Res. Natl. Bur. Standards 718(4) (1967) 242) introduced the problem (now known as the Edmonds Problem) of deciding if a given linear subspace ofM(N) contains a non-singular matrix, whereM(N) stands for the linear space of complexN ×N matrices. This problem led to many fundamental developments in matroid theory, etc. Cla...
متن کاملMinimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
We give new algorithms for the minimum (weighted) clique cover in a claw-free perfect graph G, improving the complexity from O(|V (G)|) to O(|V (G)|). The new algorithms build upon neat reformulations of the problem: it basically reduces either to solving a 2-SAT instance (in the unweighted case) or to testing if a polyhedra associated with the edge-vertex incidence matrix of a bidirected graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorica
دوره 6 شماره
صفحات -
تاریخ انتشار 1986